Local Search for Grid Scheduling
نویسندگان
چکیده
This work introduces local search based algorithms as a new technique for the Grid scheduling problem. Specific algorithms based on dispatching rules and local search were proposed and implemented to generate schedule for dynamically arriving jobs. Algorithm performance was compared with typical queue-based algorithms on the basis of objective function optimisation and time required to generate scheduling solutions. Grid environment was simulated by Alea Simulator which is based on modified and extended GridSim toolkit. The results showed that local search based algorithms may be promising technique with good overall performance, providing better results than queue-based approaches while still fast enough to provide solution in
منابع مشابه
Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملAlea - Grid Scheduling Simulation Environment
This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able to deal with common problems of the job scheduling in Grids like heterogeneity of jobs and resources, and dynamic runtime changes such as arrivals of new jobs. Our new simulator called Alea is based on the GridSim si...
متن کاملNew Hybrid Algorithm for Task Scheduling in Grid Computing to Decrease missed Task
The purpose of Grid computing is to utilize computational power of idle resources which are distributed in different areas. Given the grid dynamism and its decentralize resources, there is a need for an efficient scheduler for scheduling applications. Since task scheduling includes in the NP-hard problems various researches have focused on invented algorithms especially the genetic ones. But si...
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کامل